Brief Announcement: Self-stabilizing Silent Disjunction in an Anonymous Network
نویسندگان
چکیده
Given a network of processes G, where each process has a fixed input bit , Input(x), the disjunction problem is for each process to compute Output = ∨ x∈G Input(x), the disjunction of all input bits in the network. A distributed solution to the disjunction problem is a distributed algorithm which computes an output bit for each process, such that all output bits are equal to Output. The solution given in this paper, the distributed algorithm DISJ, correctly solves the disjunction problem if the network is connected. DISJ is self-stabilizing [1,2], meaning that a correct output configuration is reached in finite time after arbitrary initialization, and is silent, meaning that eventually the computation of DISJ will halt. DISJ works under the unfair scheduler (daemon). DISJ is uniform, meaning that every process has the same program, and is anonymous, meaning that processes are not required to have distinguished IDs. The round complexity of DISJ is O(n), where n is the size of the network. We use the composite model of computation [2]. We are not aware of any closely related work in the literature. Although we use some of the same techniques in this paper that are used for leader election, the disjunction problem in an anonymous network cannot be solved by using a leader election algorithm, nor by using an algorithm to construct a spanning tree. In fact, there is no distributed algorithm which elects a leader or which constructs a spanning tree for general anonymous networks.
منابع مشابه
Self-stabilizing Silent Disjunction in an Anonymous Network
Given a fixed input bit to each process of a connected network of processes, the disjunction problem is for each process to compute an output bit , whose value is 0 if all input bits in the network are 0, and 1 if there is at least one input bit in the network which is 1. A uniform asynchronous distributed algorithm DISJ is given for the disjunction problem in an anonymous network. DISJ is self...
متن کاملAn Efficient Silent Self-Stabilizing 1-Maximal Matching Algorithm in Anonymous Networks
We propose a new self-stabilizing 1-maximal matching algorithm which is silent and works for any anonymous networks without a cycle of length of a multiple of 3 under a central unfair daemon. The 1-maximal matching is a 2 3 -approximation to the maximum matching, and expected to get more matching pairs than a maximal matching, which only guarantees a 1 2 -approximation. The time complexity of t...
متن کاملAn Efficient Silent Self-Stabilizing Algorithm for 1-Maximal Matching in Anonymous Networks
We propose a new self-stabilizing 1-maximal matching algorithm which is silent and works for anonymous networks without a cycle of a length of a multiple of 3 under a central unfair daemon. Let e be the number of edges and let n be the number of nodes in a graph. The time complexity is O(e) moves. Therefore, the complexity is O(n) moves for trees or rings whose length is not a multiple of 3.
متن کاملA Silent Self-Stabilizing Algorithm for 1-Maximal Matching in Anonymous Networks
We propose a new self-stabilizing 1-maximal matching algorithm which is silent and works for any anonymous networks without a cycle of a length of a multiple of 3 under a central unfair daemon. Let n and e be the numbers of nodes and edges in a graph, respectively. The time complexity of the proposed algorithm is O(e) moves. Therefore, the complexity is O(n) moves for trees or rings whose lengt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012